Quotient-Complete Arc-Transitive Latin Square Graphs from Groups
نویسندگان
چکیده
منابع مشابه
AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملLocally 3-Arc-Transitive Regular Covers of Complete Bipartite Graphs
In this paper, locally 3-arc-transitive regular covers of complete bipartite graphs are studied, and results are obtained that apply to arbitrary covering transformation groups. In particular, methods are obtained for classifying the locally 3-arctransitive graphs with a prescribed covering transformation group, and these results are applied to classify the locally 3-arc-transitive regular cove...
متن کاملArc { Transitive Non { Cayley Graphs from Regular
We prove that the underlying graphs of p-gonal r-valent orientably regular maps are arc-transitive but non-Cayley if r 3 and p is a prime greater than r(r ? 1).
متن کاملOn 2-arc-transitive Cayley Graphs of Dihedral Groups
Slovenija Abstract A partial extension of the results in 1], where 2-arc-transitive cir-culants are classiied, is given. It is proved that a 2-arc-transitive Cayley graph of a dihedral group is either a complete graph or a bi-partite graph.
متن کاملOn automorphism groups of quasiprimitive 2-arc transitive graphs
We characterize the automorphism groups of quasiprimitive 2-arc-transitive graphs of twisted wreath product type. This is a partial solution for a problem of Praeger regarding quasiprimitive 2-arc transitive graphs. The solution stimulates several further research problems regarding automorphism groups of edge-transitive Cayley graphs and digraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2018
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-018-1948-y